In this paper, the problem of constructing an efficient quantum circuit forthe implementation of an arbitrary quantum computation is addressed. To thisend, a basic block based on the cosine-sine decomposition method is suggestedwhich contains $l$ qubits. In addition, a previously proposed quantum-logicsynthesis method based on quantum Shannon decomposition is recursively appliedto reach unitary gates over $l$ qubits. Then, the basic block is used and someoptimizations are applied to remove redundant gates. It is shown that the exactvalue of $l$ affects the number of one-qubit and CNOT gates in the proposedmethod. In comparison to the previous synthesis methods, the value of $l$ isexamined consequently to improve either the number of CNOT gates or the totalnumber of gates. The proposed approach is further analyzed by considering thenearest neighbor limitation. According to our evaluation, the number of CNOTgates is increased by at most a factor of $\frac{5}{3}$ if the nearest neighborinteraction is applied.
展开▼
机译：在本文中，解决了构造用于执行任意量子计算的有效量子电路的问题。为此，提出了基于余弦-正弦分解方法的基本块，其中包含$ l $个量子位。另外，递归地应用了先前提出的基于量子香农分解的量子逻辑合成方法以达到超过$ 1个量子位的单一门。然后，使用基本块，并进行一些优化以去除冗余门。结果表明，$ l $的精确值会影响所提出方法中的一个量子比特和CNOT门的数量。与先前的合成方法相比，因此检查$ l $的值以改善CNOT门的数量或门的总数。通过考虑最近邻限制进一步分析了所提出的方法。根据我们的评估，如果应用最近的邻居交互，CNOTgates的数量最多增加$ \ frac {5} {3} $。
展开▼
